Processor for processing instruction set of plurality of instructions packed into single code

ABSTRACT

A conversion table converts a packed instruction (pre-conversion code) contained in the instruction code fetched from an instruction memory into a plurality of instruction codes (converted codes). An instruction decoder decodes the plurality of the instruction codes converted by a conversion table. A plurality of ALUs perform the operation in accordance with the decoding result of the instruction decoder. Therefore, the number of instructions that can be executed in parallel per cycle may be increased while at the same time the capacity of the instruction memory is reduced.

BACKGROUND OF THE INVENTION

1. Field of the Invention

This invention relates to a processor for processing a plurality ofinstructions in parallel, and in particular to a processor forprocessing an instruction set of a plurality of instructions packed intoa single code.

2. Description of the Background Art

In recent years, with the spread of portable terminal devices, thedigital signal processing for processing a great amount of data such asvoices and images at high speed has become increasingly important. A DSP(digital signal processor) is typically used as a semiconductor deviceexclusive to such digital signal processing. However, in the case wherean amount of data to be processed is enormous, it is difficult toimprove the performance dramatically even with the use of an exclusiveDSP. Assuming that ten thousand sets of data are to be arithmeticallyprocessed, for example, at least ten thousand cycles are required evenif the operation on each set of data can be executed in a single machinecycle. In other words, each set of data may be processed at high speed,but the time required for processing increases in proportion to theamount of data because the data processing is in series.

In the case where an amount of data to be processed is large, theprocessing performance can be improved by parallel operation.Specifically, a plurality of operation units are prepared and operatedat the same time to process a plurality of sets of data at the sametime. In the case where the same operation is performed on a pluralityof sets of data, the method called SIMD (single instruction-multipledata streams) can be employed to reduce the area of the operation unitwhile maintaining a high parallel performance. Specifically, while aplurality of data processors are prepared, a high performance with asmall area can be exhibited by providing a common control unit forinterpreting an instruction and controlling the process.

Document 1 (D. A. Patterson and J. L. Hennessy, “Computer Organizationand Design”, Nikkei Business Publications) describes a method ofdecreasing the length of an instruction code to reduce the size of theinstruction memory.

Document 2 (Akira Nakamori, “Introduction to MicroprocessorArchitecture”, CQ Publishing), on the other hand, describes a method inwhich a plurality of slots are formed in one instruction format forparallel execution by VLIW (very long instruction word) in order toincrease the number of instructions that can be executed per cycle.

However, reducing the size of the instruction memory as described inDocument 1 and increasing the number of instructions that can beexecuted per cycle as described in Document 2 are in the relation ofso-called tradeoff.

Specifically, according to the method described in Document 1, it ispossible to reduce the size of the instruction memory, while the factthat a plurality of instructions are processed in series poses a problemthat a number of cycles are required to execute the instructions. Takingan example where the instruction code length is 16 bits, the instructionlength is short but four cycles are required to execute fourinstructions.

According to the method described in Document 2, on the other hand, moreinstructions may be executed per cycle, while the instruction length isincreased and so is the size of the instruction memory. In the casewhere four slots of 16 bits are provided, for example, four instructionscan be executed at the same time in a single cycle at the sacrifice ofan extended instruction code length of 64 bits.

SUMMARY OF THE INVENTION

An object of this invention is to provide a processor in which thenumber of instructions capable of being executed in parallel per cycleis increased while at the same time reducing the capacity of aninstruction memory.

According to one aspect of the invention, there is provided a processorincluding an instruction memory for storing an instruction code, aconverter for converting a packed instruction contained in aninstruction code fetched from the instruction memory into a plurality ofinstruction codes, a decoder for decoding the plurality of theinstruction codes converted by the converter, and a plurality ofoperation units for executing the operation corresponding to each of theplurality of the instruction codes in accordance with the decodingresult of the decoder.

In view of the fact that the converter converts a packed instructioncontained in an instruction code fetched from the instruction memoryinto a plurality of instruction codes and the decoder decodes theplurality of the instruction codes converted by the converter, therebycausing the plurality of the operation units to execute the operations,the number of instructions that can be executed in parallel per cyclecan be increased while at the same time reducing the capacity of theinstruction memory.

The foregoing and other objects, features, aspects and advantages of thepresent invention will become more apparent from the following detaileddescription of the present invention when taken in conjunction with theaccompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1A and 1B are diagrams showing an example of the structure of aninstruction code used for a processor according to a first embodiment ofthe invention;

FIG. 2 is a block diagram showing a schematic configuration of theprocessor according to the first embodiment of the invention;

FIG. 3 is a flowchart for explaining the processing steps in a compilerfor writing an instruction set in a conversion table 13 of the processoraccording to a second embodiment of the invention;

FIG. 4 is a block diagram showing a schematic configuration of theprocessor according to a third embodiment of the invention;

FIG. 5 is a block diagram showing a schematic configuration of theprocessor according to a fifth embodiment of the invention;

FIG. 6 is a block diagram showing a schematic configuration of theprocessor according to a seventh embodiment of the invention;

FIG. 7 is a block diagram showing a schematic configuration of theprocessor according to an eighth embodiment of the invention;

FIG. 8 is a block diagram showing a schematic configuration of theprocessor according to a tenth embodiment of the invention; and

FIG. 9 is a diagram for explaining the pipelining process executed bythe processor at the time of jumping according to the tenth embodiment.

DESCRIPTION OF THE PREFERRED EMBODIMENTS First Embodiment

FIGS. 1A and 1B are diagrams showing an example of the structure of aninstruction code used for the processor according to the firstembodiment of the invention. As shown in FIG. 1A, this instruction codeincludes a pack valid bit (V) indicating a packed instruction, a packedinstruction, an operation code and an operand Mp of an instruction 1, anoperation code and an operand Ap of an instruction 2 and a mode bit (M)indicating the operation mode of the processor. A “1 d@p1” is aninstruction for loading the data from an address indicated by a registerp1, and an “add @p2” is an instruction for adding the data stored at theaddress indicated by a register p2 and the data stored in, for example,an accumulator.

In the case where the pack valid bit is a valid “1”, a plurality ofinstructions are selected in accordance with a 4-bit packed instructionas described later. In the case where the packed instruction is “0100”,for example, four instructions including “mv r1, r5”, “inc r5, 2”, “mvr2, r3” and “inc r4, 1” are selected as shown in FIG. 1B. The “mv”instruction is for data transfer between registers, and the “inc”instruction is for incrementing the contents of the register.

In the case where the pack valid bit is invalid “0”, a 4-bit packedinstruction is processed as one instruction.

FIG. 2 is a block diagram showing a general configuration of a processoraccording to the first embodiment of the invention. This processorincludes an instruction memory 11, an instruction queue 12, a conversiontable 13 for converting a packed instruction into a plurality ofinstruction codes and outputting the instruction codes, an instructionselector 14 for selectively outputting a plurality of convertedinstruction codes from conversion table 13 and a packed instruction frominstruction queue 12 in accordance with the pack valid bit, aninstruction decoder 15, a register file 16 and ALUs 17-1 to 17-4.

Instruction memory 11 stores a program to be executed by the processor.Instruction queue 12 temporarily stores the instruction code fetchedfrom instruction memory 11. Of the 16-bit instruction code stored ininstruction queue 12, the packed instruction is applied to conversiontable 13 and instruction selector 14 as a 4-bit pre-conversion code. Theremaining 12 bits are applied directly to instruction decoder 15.

Conversion table 13 includes a plurality of flip-flops 21-1 to 21-nconnected to a data bus 23 and a selector 22 for selecting the outputsof flip-flops 21-1 to 21-n in accordance with a 4-bit pre-conversioncode received from instruction queue 12.

Flip-flops 21-1 to 21-n each store a converted 32-bit code including aplurality of instructions through data bus 23. Data bus 23 is connectedto the output port, for example, of a computer not shown, and the usercan write contents of conversion table 13 from outside. The flip-flopsare arbitrary in number, and each corresponds to a 4-bit pre-conversioncode. Specifically, in the case where the pre-conversion code is 4 bits,up to 16 flip-flops may be included. The pre-conversion code is notlimited to 4 bits, but the number of corresponding flip-flops can beincreased by increasing the number of bits.

The 32-bit converted code selected by selector 22 is applied toinstruction selector 14. In the case where the pack valid bit is a valid“1”, instruction selector 14 selects the 32-bit converted code receivedfrom selector 22 and outputs it to instruction decoder 15, while in thecase where the pack valid bit is invalid “0”, on the other hand, the4-bit packed instruction is selected and output to instruction decoder12. In this case, the 4-bit packed instruction is processed as a singleinstruction code.

Instruction decoder 15 includes a plurality of decode blocks 151 to 156.In the case where the pack valid bit is a valid “1”, block 151individually decodes the four instruction codes received frominstruction selector 14, and applies the decoding result to ALUs 17-1 to17-4. In the case where the pack valid bit is an invalid “0”, on theother hand, the result of decoding the one instruction code receivedfrom instruction selector 14 is applied to any one of ALUs 17-1 to 17-4and only one ALU is caused to execute the operation.

Blocks 152 and 153 decode the operation code of instruction 1 and theoperation code of instruction 2, respectively, and output the decodingresult as a control signal to an operation array not shown. Blocks 154and 155, on the other hand, decode the operand portion of instruction 1and the operand portion of instruction 2, respectively, and output thedecoding result as a control signal to an operation array not shown.

Block 156 decodes pack valid bit (v) and mode bit (M), and applies thedecoding result as a control signal to each block of the processor.

Register file 16 is a group of registers for holding the data to beoperated and the data constituting the result of operation. ALUs 17-1 to17-4 receive the decoding result from instruction decoder 15, and whileaccessing the data held in register file 16 through common buses 18-1and 18-2, executes the parallel operation. ALUs 17-1 to 17-4 can readthe data at the same time from register file 16 through common buses18-1 and 18-2.

Register file 16 receives and stores the results of the operations ofALUs 17-1 to 17-4 through common buses 19 and 20. The decoding resultapplied from instruction decoder 15 to ALUs 17-1 to 17-4 includes anoperand as shown in FIG. 1B.

As explained above, with the processor according to this embodiment, inthe case where the pack valid bit is a valid “1”, conversion table 1selects a plurality of instruction codes in accordance with the packedinstruction, instruction selector 14 selects and outputs the convertedcode containing a plurality of the instruction codes output fromconversion table 13, and instruction decoder 15 decodes the plurality ofthe instruction codes and causes a plurality of the ALUs to execute theoperations. In this way, a plurality of instructions can be packed intoa single instruction code and the instruction memory can be reduced insize, while at the same time increasing the number of instructions thatcan be executed in one cycle.

Also, the operation can be executed at higher speed, and the powerconsumption required to fetch the instruction code can be reduced.

Also, a plurality of the instructions stored in flip-flops 21-1 to 21-ncan be changed in accordance with the execution program. Byincorporating an instruction set suitable for the program in flip-flops21-1 to 21-n, therefore, the operation can be executed at higher speed.

Second Embodiment

In the first embodiment of the invention, the user writes an instructionset in conversion table 13 from outside. According to the secondembodiment, in contrast, a compiler implemented by the computer writesan instruction set in conversion table 13.

The general configuration of the processor according to this embodimentis similar to that of the processor according to the first embodimentshown in FIG. 2. Therefore, similar or identical component parts of theconfiguration and functions are not described in detail again.

FIG. 3 is a flowchart for explaining the steps of the process executedby the compiler for writing an instruction set in conversion table 13 ofthe processor according to the second embodiment of the invention.First, the compiler prepares a list of packed instructions (a pluralityof instruction codes executed in parallel) from the instruction codedescribed in a program (S11), and generates a histogram according to thefrequency of occurrence of the packed instruction (S12).

As indicated in step S12 of FIG. 3, the frequency of occurrence of “mvr1, r5; inc r1, 2; . . . ” is 26, the frequency of occurrence of “mv r2,r3; mv r3, r4; . . . ” is 154 and the frequency of occurrence of “incr3, 2; inc r5, 1; . . . ” is 3.

Next, in accordance with the frequency of occurrence of the packedinstruction, the sorting is carried out (S13), a plurality of theinstruction codes are transferred to flip-flops 21-1 to 21-n in thedescending order of the frequency of occurrence (S14) thereby tocomplete the process. The plurality of the instruction codes, like inthe first embodiment, are transferred to conversion table 13, forexample, through the output port of the computer, not shown, connectedto data bus 23.

In the compiler, a packed instruction is assigned to the plurality ofthe instruction codes in accordance with which one of flip-flops 21-1 to21-n the plurality of the instruction codes are transferred to, and theprogram instruction is converted to a machine language using theparticular packed instruction.

As explained above, in the processor according to this embodiment, aplurality of the instruction codes determined as high in the frequencyof occurrence by the compiler are packed and a plurality of theinstruction codes are written in conversion table 13. In addition to theeffects explained with reference to the first embodiment, therefore, agroup of instructions high in compression efficiency can be packed andthe instruction memory can be further reduced in size.

Third Embodiment

FIG. 4 is a block diagram showing a general configuration of theprocessor according to a third embodiment of the invention. In theprocessor according to this embodiment, as compared with the processoraccording to the first embodiment shown in FIG. 2, only the internalstructure of conversion table 13 is different. The component parts ofthe configuration and functions similar or identical to those of thefirst embodiment, therefore, are not described in detail again.

Conversion table 13 includes a SRAM (static random access memory) and anassociative memory 24. The 4-bit pre-conversion code output frominstruction queue 12 is applied as an address of memory 24. Memory 24has a width of 32 bits and a plurality of instruction codes are storedin each memory area.

A computer not shown is assumed to write a plurality of instructioncodes sequentially in memory 24 through data bus 23 by outputting aplurality of the instruction codes to data bus 23 while controlling theaddress.

As explained above, in the processor according to this embodiment,conversion table 13 is configured of memory 24, and therefore, inaddition to the effects described in the first embodiment, the hardwareconfiguration can be simplified and reduced in size.

Fourth Embodiment

The processor according to a fourth embodiment of the invention isdifferent from the processor according to the first embodiment shown inFIG. 2 only in that the data bus of the processor is connected to databus 23. The component parts of the configuration and functions similaror identical to those of the aforementioned embodiments, therefore, arenot described in detail again.

The processor writes a plurality of instructions in conversion table 13through data bus 23 as a bus master at a predetermined timing such asresetting. In the process, until a plurality of the instructions arecompletely written in conversion table 13, the processor executes theprocess with the pack valid bit set to invalid “0” according to theprogram, and upon completion of writing the plurality of theinstructions in conversion table 13, the execution of the packedinstructions becomes possible.

As explained above, the processor according to this embodiment writes aplurality of instruction codes in conversion table 13 by itself as a busmaster. In addition to the effects explained in the first embodiment,therefore, a plurality of instruction codes are not required to betransferred to conversion table 13 from an external source, and theprocessor can execute the process by itself.

Fifth Embodiment

The first embodiment, as shown in FIG. 1, is so configured that theinstruction code includes packed and non-packed instructions. Accordingto this embodiment, on the other hand, the instruction code includesonly packed instructions. Therefore, the instruction code contains nopack valid bit.

FIG. 5 is a block diagram showing a general configuration of theprocessor according to a fifth embodiment of the invention. Theprocessor according to this embodiment is different from the processoraccording to the first embodiment shown in FIG. 2 only in thatinstruction selector 14 is eliminated, the output of selector 22 isapplied directly to instruction decoder 15 and that the block ininstruction decoder 15 for decoding the non-packed instructions isdeleted. The component parts of the configuration and functions similaror identical to those of the aforementioned embodiments, therefore, arenot described in detail again.

As explained above, in the processor according to this embodiment, theinstruction code includes only the packed instruction. In addition tothe effects described in the first embodiment, therefore, the number ofbits of the packed instruction can be increased and a greater number ofinstruction sets can be packed, thereby making it possible to execute agreater number of instructions in parallel.

Sixth Embodiment

In the first embodiment, a plurality of the instructions written inconversion table 13 contain an operand. According to the sixthembodiment, on the other hand, the instructions written in conversiontable 13 contain no operand but only the operation code is packed.

The processor according to this embodiment has a general configurationsimilar to that of the first embodiment shown in FIG. 2. Nevertheless,the operand of the instructions to be packed is included in theinstruction code stored in instruction queue 12. Instruction decoder 15decodes the particular operand and applies the decoding result to ALUs17-1 to 17-4.

Conversion table 13 outputs a plurality of the instruction codescontaining only the operation code to instruction selector 14.Instruction decoder 15 decodes the operation code of the instructioncode received from instruction selector 14 and applies the decodingresult to ALUs 17-1 to 17-n.

As explained above, in the processor according to this embodiment, theoperand is not stored in flip-flops 21-1 to 21-n in conversion table 13.In addition to the effects explained in the first embodiment, therefore,the circuit size of conversion table 13 can be further reduced.

Seventh Embodiment

FIG. 6 is a block diagram showing a general configuration of theprocessor according to a seventh embodiment of the invention. Theprocessor according to this embodiment is different from the processoraccording to the first embodiment shown in FIG. 2 only in thatconversion table 13 is interposed between instruction memory 11 andinstruction queue 12. The component parts of the configuration andfunctions similar or identical to those of the aforementionedembodiments, therefore, are not described in detail again.

The packed instruction contained in the instructions fetched frominstruction memory 11 is applied to conversion table 13 as a 4-bitpre-conversion code on the one hand and to instruction selector 14 onthe other hand. The remaining 12 bits are applied directly toinstruction queue 12.

The 32-bit converted code selected by selector 22 is applied toinstruction selector 14. In the case where the pack valid bit is a valid“1”, instruction selector 14 selects the 32-bit converted code receivedfrom selector 22 and outputs it to instruction queue 12, while in thecase where the pack valid bit is an invalid “0”, on the other hand, the4-bit packed instruction is selected and output to instruction queue 12.

Instruction queue 12 outputs the instruction code held therein toinstruction decoder 15 and causes instruction decoder 15 to decode it ata predetermined timing.

As explained above, in the processor according to this embodiment,conversion table 13 is interposed between instruction memory 11 andinstruction queue 12. In addition to the effects explained in the firstembodiment, therefore, the delay time before the instruction code istransferred from instruction queue 12 to instruction decoder 15 anddecoded is shortened. In the case where the delay time before theinstruction code is transferred from instruction queue 12 to instructiondecoder 15 and decoded constitutes the critical path of the processor asa whole, the overall operating frequency of the processor can beimproved.

Eighth Embodiment

FIG. 7 is a block diagram showing a general configuration of theprocessor according to an eighth embodiment of the invention. Theprocessor according to this embodiment is different from the processoraccording to the first embodiment shown in FIG. 2 only in thatinstruction queue 12 is deleted. The component parts of theconfiguration and functions similar or identical to those of theaforementioned embodiments, therefore, are not described in detailagain.

The packed instruction contained in the instructions fetched frominstruction memory 11 is applied to conversion table 13 as a 4-bitpre-conversion code on the one hand and applied to instruction selector14 at the same time. The remaining 12 bits are applied directly toinstruction decoder 15.

The 32-bit converted code selected by selector 22 is applied toinstruction selector 14. In the case where the pack valid bit is a valid“1”, instruction selector 14 selects the 32-bit converted code receivedfrom selector 22 and outputs it to instruction decoder 15, while in thecase where the pack valid bit is an invalid “0”, on the other hand, the4-bit packed instruction is selected and output to instruction decoder15.

As explained above, in the processor according to this embodiment,instruction queue 12 is deleted, and therefore, in addition to theeffects described in the first embodiment, the circuit size of the wholeprocessor can be reduced.

Ninth Embodiment

According to the ninth embodiment, unlike in the first embodiment inwhich a plurality of packed instruction codes are processed in parallel,a plurality of packed instruction codes are serially processed.

The general configuration of the processor according to this embodimentis similar to that of the processor according to the first embodimentshown in FIG. 1. Nevertheless, a predetermined bit of the packedinstruction indicates parallel or serial execution, and instructionselector 14 changes the process by reference to the particularpredetermined bit.

In the case where the packed instruction indicates the parallelexecution, instruction selector 14 outputs the 32-bit converted codefrom selector 22 to instruction decoder 15 at a time. In the case wherethe packed instruction indicates the serial execution, on the otherhand, instruction selector 14 serially outputs the 32-bit converted codefrom selector 22 in a plurality of cycles.

In the case where 4 instruction codes are output from selector 22, forexample, the instruction codes are sequentially output to instructiondecoder 15 in 4 cycles, and the instruction decoder 15 decodes the 4instructions sequentially. The decoding result is continuously appliedto one of ALUs 17-1 to 17-4.

As explained above, in the processor according to this embodiment, aplurality of packed instruction codes are processed serially. Inaddition to the effects explained in the first embodiment, therefore,the instructions serially executed can be also packed, thereby making itpossible to further improve the instruction compression efficiency.

Tenth Embodiment

FIG. 8 is a block diagram showing a general configuration of theprocessor according to a tenth embodiment of the invention. Theprocessor according to this embodiment, as compared with the processoraccording to the first embodiment shown in FIG. 1, includes a jumpdestination instruction storage unit 31 for registering the instructionof the jump destination and a flip-flop 32 for holding the address ofthe jump destination.

Assume that the jump instruction free of penalty is decoded byinstruction decoder 15 during execution of a program by the processor.An instruction registration control signal is output to jump destinationinstruction storage unit 31. The jump instruction free of penalty isassumed to include an unconditional branch instruction or a conditionalbranch instruction satisfying the branch conditions.

In the case where a jump destination instruction is stored ininstruction queue 12, jump destination instruction storage unit 31 holdsthe particular jump destination instruction. In the case whereinstruction decoder 15 decodes a jump instruction free of penalty,flip-flop 32 holds the jump destination address output from instructiondecoder 15. Instruction selector 14, by reference to the jumpdestination address held in flip-flop 32, stores the correspondencebetween the jump destination address and the jump destinationinstruction held in jump destination instruction storage unit 31. In thecase where a jump instruction free of penalty is decoded by instructiondecoder 15, a similar process is executed if the particular jumpdestination instruction is not held in jump destination storage unit 31.

Next, assume that in the case where instruction decoder 15 decodes ajump instruction free of penalty, instruction selector 14 determinesthat a jump destination instruction corresponding to the jumpdestination address held in flip-flop 32 is held in jump destinationinstruction storage unit 31. The particular jump destination instructionis read from jump destination instruction storage unit 31 and output toinstruction decoder 15. In the process, the address of the instructionnext to the jump destination instruction is applied to a program counternot shown.

FIG. 9 is a diagram for explaining the pipelining process executed bythe processor at the time of jump according to the tenth embodiment ofthe invention. The upper half of FIG. 9 shows the jump process accordingto this embodiment, in which the address of instruction 1 is issued incycle T1 and the address of instruction 2 is issued in cycle T2 while atthe same time instruction 1 is fetched. Instruction 1 is a jumpinstruction free of penalty.

In cycle T3, a jump instruction free of penalty is decoded byinstruction decoder 15, and instruction selector 14, by referring to thejump destination address held in flip-flop 32, reads the jumpdestination instruction from jump destination instruction storage unit31 and outputs it to instruction decoder 15. In the process, the addressof the instruction next to the jump destination instruction is appliedto a program counter not shown, and this address is issued.

In cycle T4, the jump destination instruction is executed, theinstruction next to the jump destination instruction is fetched, whileat the same time the address of the next instruction but one is issued.In cycle T5 and subsequent cycles, a similar pipelining process isexecuted.

The instruction next to the jump instruction is stored in instructionqueue 12. Even in the case where the branch conditions of theconditional branch instruction fail to be met, therefore, the pipeliningprocess similar to that shown in the upper half of FIG. 9 can be carriedout by applying the particular instruction to instruction decoder 15.

The lower half of FIG. 9, on the other hand, indicates the conventionaljump process. In cycle T1, the address of instruction 1 is issued, andin cycle T2, the address of instruction 2 is issued while at the sametime instruction 1 is fetched. Instruction 1 is a jump instructionrequiring the branch prediction.

In cycle T3, a jump instruction is decoded by instruction decoder 15. Inthis case, it is assumed that the branch prediction fails and theinstruction of the branch destination is required to be fetched again.In this cycle, the instruction stored in instruction queue 12 isinvalidated and processed as a NOP (non-operation) instruction.

In cycle T4, the NOP instruction is executed and the jump destinationinstruction is fetched, while at the same time the address of theinstruction next to the jump destination instruction is issued. In cycleT5 and subsequent cycles, a similar pipelining process is executed. Inthis way, a one-cycle delay occurs as compared with the jump instructionfree of penalty.

Even in the case of a jump instruction free of penalty, the jumpdestination instruction may be required to be fetched, as shown in thelower half of FIG. 9, unless the jump instruction is held in jumpdestination instruction storage unit 31. In such a case, a one-cycledelay occurs.

As explained above, with the processor according to this embodiment, inthe case where a jump destination instruction is held in jumpdestination instruction storage unit 31, the particular jump destinationinstruction is applied to instruction decoder 15. Thus, the penalty inthe cycle of jump can be eliminated, and the delay due to theirregularities of the pipeline is prevented.

Specifically, according to the prior art including the branchprediction, a failure of the branch prediction results in therequirement of a repeated instruction fetch, and therefore a jumppenalty occurs. In the processor according to this embodiment, on theother hand, no jump penalty occurs as long as a jump destinationinstruction is held in jump destination instruction storage unit 31.

Although the present invention has been described and illustrated indetail, it is clearly understood that the same is by way of illustrationand example only and is not to be taken by way of limitation, the spiritand scope of the present invention being limited only by the terms ofthe appended claims.

1-13. (canceled)
 14. A data processor comprising: an instruction fetchunit; an instruction decode unit; an instruction execute unit; and aninstruction interpretation unit; wherein the instruction fetch unitfetches an instruction from a memory, the instruction having at least afirst part and a second part, wherein the instruction interpretationunit interprets a binary pattern in the first part of the instruction asan instruction package containing a plurality of instructions byreferring to a converting table when the second part of the instructionindicates a first status, or as a single instruction when the secondpart of the instruction indicates a second status, wherein theinstruction decode unit decodes each of the plurality of instructions ofthe instruction package interpreted by the instruction interpretationunit when the second part of the instruction indicates the first status,or decodes the single instruction when the second part of theinstruction indicates the second status, wherein the instructionexecution unit executes the plurality of instructions or the singleinstruction decoded by the instruction decode unit, and wherein theconverting table is supplied from the outside data processor.
 15. A dataprocessor according to claim 14, wherein the instruction execute unitexecutes the plurality of instructions whether in serial or in parallelin accordance with a third part of the instruction.
 16. A data processorbeing adapted to perform each functions following: an instructionfetching function that fetches an instruction from a memory, aninstruction interpreting function that interprets a binary pattern in afirst part of the instruction as a plurality of instructions byreferring a converting table when a second part of the instructionindicates a first status, or as a single instruction when the secondpart of the instruction indicates a second status, an instructiondecoding function that decodes each of the plurality of instructionswhen the second part of the instruction indicates the first status, ordecodes the single instruction when the second part of the instructionindicates the second status, an instruction executing function executeseach of the plurality of instructions or the single instruction, and areading function that reads the converting table from outside the dataprocessor.
 17. A data processor according to claim 16, wherein theinstruction execution function that executes the plurality ofinstructions whether in serial or in parallel in accordance with a thirdpart of the instruction.